搜索资源列表
graph
- 几乎包含了图的所有操作，邻接矩阵，邻接表建立，递归非递归深搜广艘遍历，floyd,prim,kruscal,地界斯特拉算法，拓扑排序，关键路径-Figure includes almost all the operations, the adjacency matrix, adjacency list creation, deep search recursive non-recursive traversal wide ship, floyd, prim, kruscal, boundary
graph
- 1. 分别以邻接矩阵和邻接表的存储结构建立图。 2. 分别对图进行深度优先遍历和广度优先遍历。 3. 求图中边的数目。 4. 求顶点0到图中其余每个顶点的最短路径。 -1, respectively, the adjacency matrix and adjacency list storage structure created map. 2, respectively, the graph depth-first traversal and breadth-fir
Adjacency-matrix
- 分别以邻接矩阵和邻接表的存储结构建立图。 分别对图进行深度优先遍历和广度优先遍历。 求图中边的数目。 求顶点0到图中其余每个顶点的最短路径-Respectively adjacency matrix and adjacency list storage structure created map. Respectively graph depth-first traversal and breadth-first traversal. In the figure, the numbe
Graph
- 创建有向图的邻接表，在此临界表的基础上进行拓扑排序Create a directed graph adjacency table, the table in this critical topological sort on the basis of-Create a directed graph adjacency table, the table in this critical topological sort on the basis of
Graph
- 创建有向图的邻接表，在此临界表的基础上进行拓扑排序Create a directed graph adjacency table, the table in this critical topological sort on the basis of-Create a directed graph adjacency table, the table in this critical topological sort on the basis of
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve
Graph-Alothrim
- 利用邻接链表的形式存储图，并进行深度优先访问。-Using adjacency list is stored in the form of maps, and depth-first visit.
Graph
- 输入图的节点，节点之间的连接关系，实现求一个图的邻接矩阵。-Seeking to achieve an adjacency matrix
Graph
- Graph with adjacency list with dfs and bfs traversal functions
BankC
- 一个简单的银行的计算系统 适合初学者看看 对了 是C#程序哦 -Abstract：As a region merge technology for image segmentation, traditional method of Region Adjacency Graph（RAG）has lots of shortness such as complicated data structure and algorithm, difficulty of expansibility and m
cloud-classification
- 图像分割是一种重要的图像分析技术，对图像分割的研究一直是图像技术研究中的热点和焦点。分水岭算法是基于数学形态学理论的图像分割算法，但是对噪声敏感且存在过分割的现象。为提高图像分割效果，本文通过对影像进行滤波处理，用改进的快速区域合并算法优化分水岭算法进行影像分割。-In this work a technique for cloud detection and classification from MSG–SEVIRI (Meteosat Second Generation–Spinning
Adjacency-table-storage
- 四种图：无向图，有向图，无向网，有向网的邻接表存储-Four kinds Figure: undirected graph, directed graph, undirected network, the network has adjacency table storage
graph
- 掌握图的两种存储结构； 掌握Dijkstra算法； 掌握Prim及Kruskal算法； 邻接矩阵、最短路径及其长度 邻接表、最小生成树 -Learn two storage structure Master Dijkstra algorithm Master Prim and Kruskal algorithm Adjacency matrix, and the length of the shortest path Adjac
Graph
- 用邻接表存储的图，实现了插入、删除、查找、拓扑排序、关键路径、查找路径等算法。-Adjacency table stored map to achieve the insert, delete, search, topological sort, critical path, find the path algorithm.
graph
- 数据结构图的存储和遍历，包括邻接矩阵方式存储图和图的查找-The data structure of the storage and traversal, including the adjacency matrix storage map and map search
Graph
- 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs
graph
- 编写程序，输出图的邻接矩阵，输出两种遍历序列，并求出最小生成树-Write a program that outputs the adjacency matrix output two kinds of traversal sequences and finding the minimum spanning tree
Graph-traversal
- 采用图的邻接矩阵或邻接表实现最短路径问题中图的存储，采用递归程序实现图的深度优先搜索（DFS）-Using adjacency matrix or adjacency list shortest path problem in memory map, using a recursive program implements graph depth-first search
Basic-function-of-graph
- 图的基本操作，包括建立邻接矩阵，图的广度和深度优先搜索-The basic operation pattern, including the establishment of the adjacency matrix, the breadth and depth map of priority search
linjiegudejianli
- 图的邻接图的建立，是图的建立中的一种比较重要的方法，本程序运用简单易懂的方法实现该程序的实现。-Figure of the establishment of the adjacency graph, is the establishment of one of the important methods, the program using the simple method to implement the program.